A Lower Bound Theorem
نویسنده
چکیده
Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.
منابع مشابه
عدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملUpper bound and numerical analysis of cyclic expansion extrusion (CEE) process
Deformation of the material during cyclic expansion extrusion (CEE) is investigated using upper-bound theorem. The analytical approximation of forming loads agrees very well with the FEM results for different amounts of chamber diameter, friction factor and also for lower die angles. However, the difference between analytical and numerical solution increases at higher die angles which are expla...
متن کاملTwo Equivalent Presentations for the Norm of Weighted Spaces of Holomorphic Functions on the Upper Half-plane
Introduction In this paper, we intend to show that without any certain growth condition on the weight function, we always able to present a weighted sup-norm on the upper half plane in terms of weighted sup-norm on the unit disc and supremum of holomorphic functions on the certain lines in the upper half plane. Material and methods We use a certain transform between the unit dick and the uppe...
متن کاملA Berry-Esseen Type Bound for the Kernel Density Estimator of Length-Biased Data
Length-biased data are widely seen in applications. They are mostly applicable in epidemiological studies or survival analysis in medical researches. Here we aim to propose a Berry-Esseen type bound for the kernel density estimator of this kind of data.The rate of normal convergence in the proposed Berry-Esseen type theorem is shown to be O(n^(-1/6) ) modulo logarithmic term as n tends to infin...
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملLower bound theorem for normal pseudomanifolds
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup’s generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected tria...
متن کامل